Automatic Verification Flow Shop Scheduling of Electric Energy Meters Based on an Improved Q-Learning Algorithm
نویسندگان
چکیده
Considering the engineering problem of electric energy meter automatic verification and scheduling, this paper proposes a novel scheduling scheme based on an improved Q-learning algorithm. First, by introducing state variables behavior variables, ranking combinatorial optimization is transformed into sequential decision problem. Then, reward function proposed to evaluate pros cons different strategies. In particular, considers adopting reinforcement learning algorithm efficiently solve addition, also ratio exploration utilization in process, then provides reasonable through iterative updating scheme. Meanwhile, decoupling strategy introduced address restriction over estimation. Finally, real time data from provincial center are used verify effectiveness
منابع مشابه
Flow-shop Scheduling Based on Reinforcement Learning Algorithm
In the paper a machine learning based method will be proposed to give a quasioptimal solution to the m-machine flow-shop scheduling problem. Namely, given a set of parts to be processed and a set of machines to carry out the process and the sequence of machines is fixed, each part should have the same technological path on all machines; the order of jobs can be arbitrary. The goal is to find ap...
متن کاملImproved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کاملAn Improved Tabu Search Algorithm for Job Shop Scheduling Problem Trough Hybrid Solution Representations
Job shop scheduling problem (JSP) is an attractive field for researchers and production managers since it is a famous problem in many industries and a complex problem for researchers. Due to NP-hardness property of this problem, many meta-heuristics are developed to solve it. Solution representation (solution seed) is an important element for any meta-heuristic algorithm. Therefore, many resear...
متن کاملAn improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
We study the problem of scheduling n jobs in a two-machine flow shop where the second machine is not available for processing during a given time interval. A resumable scenario is assumed, i.e if a job cannot be finished before the down period it is continued after the machine becomes available again. The objective is to minimize the makespan. The best fast approximation algorithm for this prob...
متن کاملImproved Bounds for Flow Shop Scheduling
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used lower bound on the optimal makespan. We also obtain a nearly tight hardness result for the general version of flow shops, where jobs are not required to be processed on each machine. Similar results hold true when the object...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Energies
سال: 2022
ISSN: ['1996-1073']
DOI: https://doi.org/10.3390/en15051626